30 research outputs found

    On the p-parts of Weyl group multiple Dirichlet series

    Full text link
    We study the structure of pp-parts of Weyl group multiple Dirichlet series. In particular, we extend results of Chinta, Friedberg, and Gunnells and show, in the stable case, that the pp-parts of Chinta and Gunnells agree with those constructed using the crystal graph technique of Brubaker, Bump, and Friedberg. In this vein, we give an explicit recurrence relation on the coefficients of the pp-parts, which allows us to describe the support of the pp-parts and address the extent to which they are uniquely determined.Comment: 18 pages, 4 figures; typos corrected, extended results in section

    Effective Congruences for Mock Theta Functions

    Get PDF
    Let M(q)=∑c(n)qn role= presentation style= box-sizing: border-box; max-height: none; display: inline; line-height: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; color: rgb(34, 34, 34); font-family: Arial; position: relative; \u3eM(q)=∑c(n)qnM(q)=∑c(n)qn be one of Ramanujan’s mock theta functions. We establish the existence of infinitely many linear congruences of the form: c(An+B)≡0 (modlj) role= presentation style= box-sizing: border-box; max-height: none; display: inline; line-height: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; color: rgb(34, 34, 34); font-family: Arial; position: relative; \u3ec(An+B)≡0 (modlj)c(An+B)≡0 (modlj) where A is a multiple of l and an auxiliary prime, p. Moreover, we give an effectively computable upper bound on the smallest such p for which these congruences hold. The effective nature of our results is based on the prior works of Lichtenstein [1] and Treneer [2]

    Crystal constructions in Number Theory

    Full text link
    Weyl group multiple Dirichlet series and metaplectic Whittaker functions can be described in terms of crystal graphs. We present crystals as parameterized by Littelmann patterns and we give a survey of purely combinatorial constructions of prime power coefficients of Weyl group multiple Dirichlet series and metaplectic Whittaker functions using the language of crystal graphs. We explore how the branching structure of crystals manifests in these constructions, and how it allows access to some intricate objects in number theory and related open questions using tools of algebraic combinatorics

    On the formulas of Tokuyama and Gindikin-Karpelevich for G2

    No full text
    Non UBCUnreviewedAuthor affiliation: Williams CollegePostdoctora
    corecore